Termination w.r.t. Q proof of /home/nowonder/forschung/aprove/satrung/aprove/lpar4/nonterminSLASHCSRSLASHExConc

Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

f₁(X) -> g₁(h₁(f₁(X)))

Q is empty.

↳ QTRS

  ↳ Non-Overlap Check

Q restricted rewrite system:
The TRS R consists of the following rules:

f₁(X) -> g₁(h₁(f₁(X)))

Q is empty.

The TRS is non-overlapping. Hence, we can switch to innermost.

↳ QTRS

  ↳ Non-Overlap Check

    ↳ QTRS

      ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

f₁(X) -> g₁(h₁(f₁(X)))

The set Q consists of the following terms:

f₁(x0)

Q DP problem:
The TRS P consists of the following rules:

F₁(X) -> F₁(X)

The TRS R consists of the following rules:

f₁(X) -> g₁(h₁(f₁(X)))

The set Q consists of the following terms:

f₁(x0)

We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ Non-Overlap Check

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

F₁(X) -> F₁(X)

The TRS R consists of the following rules:

f₁(X) -> g₁(h₁(f₁(X)))

The set Q consists of the following terms:

f₁(x0)

We have to consider all minimal (P,Q,R)-chains.